Reducing Nondeterminism in the Calculus of Structures

The calculus of structures is a proof theoretical formalism which generalizes the sequent calculus with the feature of deep inference: in contrast to the sequent calculus, inference rules can be applied at any depth inside a formula, bringing shorter proofs than all other formalisms supporting analytical proofs. However, deep applicability of inference rules causes greater nondeterminism than in the sequent calculus regarding proof search. In this paper, we introduce a new technique which reduces nondeterminism without breaking proof theoretical properties, and provides a more immediate access to shorter proofs. We present this technique on system BV, the smallest technically non-trivial system in the calculus of structures, extending multiplicative linear logic with the rules mix, nullary mix and a self dual, non-commutative logical operator. We present implementations of system BV where this technique is employed and provide a performance comparison demonstrating the improvement due to this technique. Since this technique exploits a scheme common to all the systems in the calculus of structures, we argue that it generalizes to these systems for classical logic, linear logic and modal logics. As evidence, we demonstrate this technique on systems KSg and KS, systems for classical logic in the calculus of structures.